Iterative Solver Based on Incomplete Cholesky Preconditioner for the Parallelisation of a Forging Simulation Software by Mesh Partitioning
نویسندگان
چکیده
A parallel implementation of the preconditioned conjugate residual (PCR) method is described. The method is used to solve the discretized generalised Stokes problem derived from the simulation of complex 2D axisymetrical hot metal forming process. We numerically show that the use of a simple diagonal block (BDS) preconditioner results in a high level of parallelism. Nevertheless in 2D, the iterative solver with BDS is much slower than the direct solver. Hence, better sequential and parallel preconditioner are studied, like incomplete factorisations ILU(0). It results in an almost twice faster parallel code, but with a lost in scalability due to the increase of communications between processors. E. Perchat, L. Fourment, and T. Coupez.
منابع مشابه
On Efficiency Analysis of the OpenFOAM-Based Parallel Solver for Simulation of Heat Transfer in and Around the Electrical Power Cables
In this work, we study the efficiency of developed OpenFOAM-based parallel solver for the simulation of heat transfer in and around the electrical power cables. First benchmark problem considers three cables directly buried in the soil. We study and compare the efficiency of conjugate gradient solver with diagonal incomplete Cholesky (DIC) preconditioner, generalized geometricalgebraic multigri...
متن کاملIncomplete Cholesky Parallel Preconditioners with Selective Inversion
Consider the solution of a large linear system when the coe cient matrix is sparse, symmetric, and positive de nite. One approach is the method of \conjugate gradient" (CG) with an incomplete Cholesky (IC) preconditioner (ICCG). A key problem with the design of a parallel ICCG solver is the bottleneck posed by repeated parallel sparse triangular solves to apply the preconditioner. Our work conc...
متن کاملA parallel ILU strategy for solving Navier-Stokes equations on an unstructured 3D mesh
An iterative algorithm for solving a mixed finite element formulation of NavierStokes equations on a distributed memory computer is presented. The solver is a Krylov subspace method with a parallel preconditioner suitable for high latency clusters. Nodes are pivoted to minimize the number of synchronization points in each solver iteration. An unstructured mesh is decomposed into non-overlapping...
متن کاملThe Deflated Relaxed Incomplete Cholesky CG method for use in a real-time ship simulator
Ship simulators are used for training purposes and therefore have to calculate realistic wave patterns around the moving ship in real time. We consider a wave model that is based on the variational Boussinesq formulation, which results in a set of partial differential equations. Discretization of these equations gives a large system of linear equations, that has to be solved each time-step. The...
متن کاملA Blocked Incomplete Cholesky Preconditioner for Hierarchical-memory Computers
We develop a drop-threshold incomplete Cholesky preconditioner which uses blocked data structures and computational kernels for improved performance on computers with one or more levels of cache memory. The techniques are similar to those used for Cholesky factorization in sparse direct solvers. We report on the performance of our preconditioned conjugate gradient solver on sparse linear system...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000